The open-locating-dominating number of some convex polytopes
نویسندگان
چکیده
منابع مشابه
Open neighborhood locating dominating sets
For a graph G that models a facility, various detection devices can be placed at the vertices so as to identify the location of an intruder such as a thief or saboteur. Here we introduce the open neighborhood locating-dominating set problem. We seek a minimum cardinality vertex set S with the property that for each vertex v its open neighborhood N(v) has a unique non-empty intersection with S. ...
متن کاملOptimal open-locating-dominating sets in infinite triangular grids
An open-locating-dominating set (OLD-set) is a subset of vertices of a graph such that every vertex in the graph has at least one neighbor in the set and no two vertices in the graph have the same set of neighbors in the set. This is an analogue to the well-studied identifying code in the literature. In this paper, we prove that the optimal density of the OLD-set for the infinite triangular gri...
متن کاملEstimating the Number of Vertices in Convex Polytopes
Estimating the number of vertices of a convex polytope defined by a system of linear inequalities is crucial for bounding the run-time of exact generation methods. It is not easy to achieve a good estimator, since this problem belongs to the #P complexity class. In this paper we present two randomized algorithms for estimating the number of vertices in polytopes. The first is based on the well-...
متن کاملSome Aspects of the Combinatorial Theory of Convex Polytopes
We start with a theorem of Perles on the k-skeleton, Skel k (P) (faces of dimension k) of d-polytopes P with d+b vertices for large d. The theorem says that for xed b and d, if d is suuciently large, then Skel k (P) is the k-skeleton of a pyramid over a (d ? 1)-dimensional polytope. Therefore the number of combinatorially distinct k-skeleta of d-polytopes with d + b vertices is bounded by a fun...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2018
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1802635s